An O(n log n) algorithm for a maxmin location problem
نویسندگان
چکیده
منابع مشابه
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(log n/ log log n) of the optimum with high probability.
متن کاملAn O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks
In this paper, we consider a sink location in a dynamic network which consists of a graph with capacities and transit times on its arcs. Given a dynamic network with initial supplies at vertices, the problem is to find a vertex v as a sink in the network such that we can send all the initial supplies to v as quickly as possible. We present an O(n log n) time algorithm for the sink location prob...
متن کاملAn O(n log n) Algorithm for a Load Balancing Problem on Paths
We study the following load balancing problem on paths (PB). There is a path containing n vertices. Every vertex i has an initial load hi, and every edge (j, j + 1) has an initial load wj that it needs to distribute among the two vertices that are its endpoints. The goal is to distribute the load of the edges over the vertices in a way that will make the loads of the vertices as balanced as pos...
متن کاملA cross entropy algorithm for continuous covering location problem
Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...
متن کاملAn O(n log log n/ log n) Time Algorithm for the All-Pairs Shortest Path Problem
We design a faster algorithm for the all-pairs shortest path problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we improve the best known time complexity of O(n(log log n)/ logn) to O(n log log n/ log n). As an application, we show the k-maximum subarray problem can be solved in O(kn log log n/ log n) time for small k.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1992
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90234-2